A genetic Lloyd-Max image quantization algorithm

نویسنده

  • Paul Scheunders
چکیده

This paper is devoted to the study of optimal image quantization and its sensitivity to initial conditions. The optimal mean squared algorithm is elaborated, for gray-level as well as for color images. A genetic quantization algorithm is developed, which is a hybrid technique combining optimal quantization with a genetic algorithm. It is shown that the latter technique is almost insensitive to initial conditions and performs better than the former. In the case of color images, the difference between both techniques clearly affects the visual quality.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimization of errors in L4−norm for decoding quantized data: its application to quantization of wavelet coefficients

Two well known quantization methods are uniform quantization and Max–Lloyd. We present a novel quantization method, based on minimizing the L4−norm of the errors. This method has a performance superior to uniform quantization and Max–Lloyd when applied directly to an image, and is superior to Max–Lloyd when applied to the coefficients of a wavelet transform. We make various tests, we give an in...

متن کامل

A Multigrid Approach to the 1-D Quantization Problem

Abstract— A multigrid framework for the 1-D (scalar) quantization problem is presented. The framework is based on the Lloyd-Max iterative process, which is a central building block in many quantization algorithms. This process iteratively improves a given initial solution and generally converges to a local minimum of the quantization distortion. Contrary to the classical Lloyd-Max process, the ...

متن کامل

Fast pairwise nearest neighbor based algorithm for multilevel thresholding

We propose a fast pairwise nearest neighbor (PNN)based O(N log N) time algorithm for multilevel nonparametric thresholding, where N denotes the size of the image histogram. The proposed PNN-based multilevel thresholding algorithm is considerably faster than optimal thresholding. On a set of 8 to 16 bits-per-pixel real images, experimental results also reveal that the proposed method provides be...

متن کامل

Greedy Aggregation for Vector Quantization

Abstract. Vector quantization is a classical problem that appears in many fields. Unfortunately, the quantization problem is generally non-convex, and therefore affords many local minima. The main problem is finding an initial approximation that is close to a “good” local minimum. Once such an approximation is found, the Lloyd–Max method may be used to reach a local minimum near it. In recent y...

متن کامل

Fitting MMPP to IP Stream

Markov Modulated Posson Process (MMPP) is a good model of Internet traffic. We take an IP trace and fit an MMPP to it using an algorithm recently published in a Journal. It is observed that trace generated using the MMPP model of the original trace has a distribution similar to the original trace. This is seen in the form of a linear quantile-quantile plot. Average queuing delay with data trace...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Pattern Recognition Letters

دوره 17  شماره 

صفحات  -

تاریخ انتشار 1996